Laplacians and the Cheeger inequality for directed graphs
نویسنده
چکیده
We consider Laplacians for directed graphs and examine their eigenvalues. We introduce a notion of a circulation in a directed graph and its connection with the Rayleigh quotient. We then define a Cheeger constant and establish the Cheeger inequality for directed graphs. These relations can be used to deal with various problems that often arise in the study of non-reversible Markov chains including bounding the rate of convergence and deriving comparison theorems.
منابع مشابه
Cheeger Inequalities for Submodular Transformations
The Cheeger inequality for undirected graphs, which relates the conductance of an undirected graph and the second smallest eigenvalue of its normalized Laplacian, is a cornerstone of spectral graph theory. The Cheeger inequality has been extended to directed graphs and hypergraphs using normalized Laplacians for those, that are no longer linear but piecewise linear transformations. In this pape...
متن کاملLimits of finite graphs, Von Neumann algebras and a Cheeger type inequality
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees there exists a limit graphing and thus an associated Type-II1 von Neumann algebra. The Kesten-von Neumann-Serre spectral measure of the Laplacian on the limit graphing is the weak limit of the spectral measures of the Laplacians of the finite graphs. Using this limit techniques we prove a Cheeger type ...
متن کاملWeak convergence of finite graphs, integrated density of states and a Cheeger type inequality
In [4] we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associate a type II1-von Neumann algebra to such graph sequences. We show that in this case the integrated density of states exists that is the weak limit of the spectra of the graph Laplacians of the finite graphs is the KNS-spectra...
متن کاملLaplacians of graphs and Cheeger inequalities
We define the Laplacian for a general graph and then examine several isoperimetric inequalities which relate the eigenvalues of the Laplacian to a number of graphs invariants such as vertex or edge expansions and the isoperimetric dimension of a graph.
متن کاملEigenvalues of Transmission Graph Laplacians
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a “transmission” system. A transmission system is a mathematical representation of a means of transmitting (multi-parameter) data along directed edges from vertex to vertex. The associated transmission graph Laplacian is shown to have many of the former properties of the classica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005